The Erdös-Hajnal Conjecture - A Survey
نویسنده
چکیده
The Erdös-Hajnal conjecture states that for every graph H, there exists a constant δ(H) > 0 such that every graph G with no induced subgraph isomorphic to H has either a clique or a stable set of size at least |V (G)|. This paper is a survey of some of the known results on this conjecture.
منابع مشابه
The Erdös-Hajnal conjecture for bull-free graphs
The bull is a graph consisting of a triangle and two pendant edges. A graphs is called bull-free if no induced subgraph of it is a bull. In this paper we prove that every bull-free graph on n vertices contains either a clique or a stable set of size n 1 4 , thus settling the Erdős-Hajnal conjecture [5] for the bull.
متن کاملUpper Bounds for Erdös-Hajnal Coefficients of Tournaments
A version of the Erdős-Hajnal conjecture for tournaments states that for every tournament H every tournament T that does not contain H as a subtournament, contains a transitive subtournament of size at least n (H) for some (H) > 0, where n is the order of T . For any fixed tournament H we can denote by n0(H) the supremum over all ≥ 0 satisfying the following statement: every tournament T of ord...
متن کاملProof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs
A topological complete graph of order p comprises p vertices {v1, . . . , vp} and (p 2 ) pairwise vertex disjoint paths Pi, j , 1 ≤ i < j ≤ p, such that Pi, j joins vi to v j . It was conjectured by Mader [11], and also by Erdös and Hajnal [6], that there is a positive constant c such that any graph G of size at least cp2|G| contains a topological complete subgraph of order p. It was pointed ou...
متن کاملErdös-Gyárfás Conjecture for Cubic Planar Graphs
In 1995, Paul Erdős and András Gyárfás conjectured that for every graph of minimum degree at least 3, there exists a non-negative integer m such that G contains a simple cycle of length 2m. In this paper, we prove that the conjecture holds for 3-connected cubic planar graphs. The proof is long, computer-based in parts, and employs the Discharging Method in a novel way.
متن کاملDomination in colored complete graphs
We prove the following conjecture of Erdljs and Hajnal: For any fixed positive integer t and for any 2-coloring of the edges of K,, there exists X c V(K,) such that 1x1 I t and X monochromatically dominates all but at most n/2’ vertices of K,. In fact, X can be constructed by a fast greedy algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 75 شماره
صفحات -
تاریخ انتشار 2014